Inversion-descent polynomials for restricted permutations
نویسندگان
چکیده
We derive generating functions for a variety of distributions of joint permutation statistics all of which involve a bound on the maximum drop size of a permutation π, i.e., max{i−π(i)}. Our main result treats the case for the joint distribution of the number of inversions, the number of descents and the maximum drop size of permutations on [n] = {1, 2, . . . , n}. A special case of this (ignoring the number of inversions) connects with earlier work of Claesson, Dukes and the authors on descent polynomials for permutations with bounded drop size. In that paper, the desired numbers of permutations were given by sampling the coefficients of certain polynomials Qk. We find a natural interpretation of all the coefficients of the Qk in terms of a restricted version of Eulerian numbers.
منابع مشابه
Variations on Descents and Inversions in Permutations
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation σ = σ1σ2 · · · σn defined as the set of indices i such that either i is odd and σi > σi+1, or i is even and σi < σi+1. We show that this statistic is equidistributed with the odd 3-factor set statistic on permutations σ̃ ...
متن کاملStable multivariate Eulerian polynomials and generalized Stirling permutations
We study Eulerian polynomials as the generating polynomials of the descent statistic over Stirling permutations – a class of restricted multiset permutations. We develop their multivariate refinements by indexing variables by the values at the descent tops, rather than the position where they appear. We prove that the obtained multivariate polynomials are stable, in the sense that they do not v...
متن کاملActions on permutations and unimodality of descent polynomials
We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis {t(1 + t)} i=0 , m = ⌊(n−1)/2⌋. This property implies symmetry and unimodality. We prove that the action is invariant under stack-sorting which strengthens recent unimodality results of Bóna. We prove ...
متن کاملExcedances and Descents of Bi-increasing Permutations
Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...
متن کاملRevstack Sort, Zigzag Patterns, Descent Polynomials of $t$-revstack Sortable Permutations, and Steingrímsson's Sorting Conjecture
In this paper we examine the sorting operator T (LnR) = T (R)T (L)n. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise t-revstack sortability in terms of patterns in a permutation that we call zigzag patterns. Using these theorems we characterise those permutations of length n which are sorted by t appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 120 شماره
صفحات -
تاریخ انتشار 2013